Motion dependent video signal processing

ABSTRACT

In, for example, a motion compensated video standards converter blocks in a first field or frame of a video signal are each compared in a gate array with a plurality of blocks in the following field or frame of the video signal for deriving motion vectors representing the motion of the content of respective blocks between the first field or frame and the following field or frame, a correlation surface is generated for respective blocks in the first field or frame, the correlation surface representing the difference between the content of the block in the first field or frame and the content of each block in the following field or frame with which it has been compared, and the motion vectors are derived in dependence on a minimum in the correlation surface.

Attention is drawn to the fact that this application is one of a seriesof fourteen filed on the same day, and bearing Ser. Nos. 07/511,739;07/511,740; 07/511,799; 07/512,145; 07/512,253; 07/512,262; 07/512,263;07/512,278; 07/512,279; 07/512,381; 07/512,813; 07/513,086; 07513,087;and 07/513,426. These applications all relate to similar subject matter,and the disclosure in each is incorporated by this reference into eachother.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to motion dependent video signal processing. Moreparticularly, the invention relates to video standards converters usingsuch signal processing, and to methods of deriving motion vectorsrepresenting motion between fields or frames of a video signal.

2. Description of the Prior Art

Video standards converters are well known devices used to convert videosignals from one standard to another, for example, from a 625 lines perframe, 50 fields per second standard to a 525 lines per frame, 60 fieldsper second standard. Video standards conversion cannot be achievedsatisfactorily merely by using simple linear interpolation techniques,because of the temporal and vertical alias which is present in a videosignal. Thus, simple linear interpolation produces unwanted artefacts inthe resulting picture, in particular, the pictures are blurredvertically and judder temporally.

To reduce these problems it has been proposed that video standardsconverters should use adaptive techniques to switch the parameters of alinear interpolator in dependence on the degree of movement in thepicture represented by the incoming video signal.

It has also been proposed, for example for the purpose of data reductionin video signal processing, to generate motion vectors from an incomingvideo signal by a block matching technique, in which the content of asearch block in one field or frame is compared with the respectivecontents of a plurality of search blocks comprised in a search area inthe following field or frame, to determine the minimum differencebetween the contents so compared, and hence the direction and distanceof motion (if any) of the content of the original search block.

A problem with such block matching techniques which has inhibited theirapplication to video standards conversion is the difficulty in effectingthe necessary large amount of processing in the time available.

SUMMARY OF THE INVENTION

One object of the present invention is to provide a motion compensatedvideo standards converter using a block matching technique.

Another object of the present invention is to provide a method ofderiving motion vectors by comparing blocks of pixels in an integratedcircuit gate array.

Another object of the present invention is to provide a motioncompensated video standards converter wherein blocks of pixels fromprogressive scan frames of a video signal are compared to derive motionvectors.

According to the present invention there is provided a motioncompensated video standards converter comprising:

means for comparing blocks in a first progressive scan frame of a videosignal with a plurality of blocks in the following progressive scanframe of the video signal for deriving motion vectors representing themotion of the content of respective said blocks between said first frameand said following frame; and

an interpolator controlled in dependence on said motion vectors.

According to the present invention there is also provided a motioncompensated video standards converter comprising:

comparator means to which are serially supplied digital pixel luminancedata of a first field or frame of a video signal and of the followingfield or frame of the video signal, said comparator means comparing theluminance content of blocks in said first field or frame with aplurality of blocks in said following field or frame for deriving motionvectors representing the motion between said fields or frames; and

an interpolator controlled in dependence on said motion vectors.

According to the present invention there is also provided a method ofderiving motion vectors representing motion between successive fields orframes of a video signal, the method including comparing blocks in afirst field or frame of the video signal with a plurality of blocks inthe following field or frame of the video signal in an integratedcircuit gate array for deriving said motion vectors representing themotion of the content of respective said blocks between said first fieldor frame and said following field or frame.

The above, and other objects, features and advantages of this inventionwill be apparent from the following detailed description of illustrativeembodiments which is to be read in connection with the accompanyingdrawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an embodiment of motion compensated videostandards converter according to the present invention;

FIG. 2 shows diagrammatically progressive scan conversion;

FIGS. 3 to 6 show diagrammatically sequences of lines in sequences offields for explaining progressive scan conversion;

FIG. 7 is a block diagram showing the steps in motion adaptiveprogressive scan conversion;

FIG. 8 shows diagrammatically progressive scanning, in particular therequired estimate and difference value between successive fields;

FIGS. 9 and 10 are diagrams used in explaining the technique of FIG. 8in more detail, FIG. 9 showing a progressive scan normalizing functionand FIG. 10 showing a progressive scan nonlinear function;

FIG. 11 shows diagrammatically the creation of pixels in missing linesin progressive scan conversion;

FIGS. 12A, 12B and 13 show diagrammatically search blocks and searchareas, and the relationships therebetween;

FIG. 14 shows a correlation surface;

FIGS. 15 to 17 show parts of the embodiment in more detailed blockdiagrammatic form;

FIGS. 18, 19A and 19B show diagrammatically how a search block is grown;

FIG. 20 shows the areas of a frame in which search block matching is notpossible;

FIGS. 21A and 21B show diagrammatically a moving object straddling threesearch blocks;

FIGS. 22 to 24 show three resulting correlation surfaces, respectively;

FIGS. 25 and 26 show further examples of correlation surfaces, used indescribing a threshold test;

FIGS. 27 and 28 show still further examples of correlation surfaces,used in describing a rings test;

FIG. 29 shows diagrammatically how the direction in which a search blockis to grow is determined;

FIGS. 30A and 30B show diagrammatically how a correlation surface isweighted;

FIG. 31 shows the relationship between sample blocks and search blocks,and a frame of video;

FIG. 32 shows motion vector regions in a frame of video;

FIGS. 33 to 35 show diagrams used in explaining motion vector reductionin respective regions of a frame of video;

FIGS. 36 and 37 show diagrammatically a first stage in motion vectorselection;

FIGS. 38 and 39 show diagrammatically how a threshold is establishedduring the motion vector selection;

FIG. 40 shows diagrammatically a second stage in motion vectorselection;

FIGS. 41 to 47 show arrays of pixels with associated motion vectors usedin explaining motion vector post-processing; and

FIGS. 48A, 48B and 48C show diagrammatically the operation of aninterpolator.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The embodiment of motion compensated video standards converter to bedescribed is particularly intended for use in the conversion of a highdefinition video signal (HDVS) having 1125 lines per frame, 60 fieldsper second, to 24 frames per second 35 mm film. However, it will beunderstood that the invention is not limited in this respect, and thatthe standards converter can readily be adapted to effect conversionsbetween other standards.

FIG. 1 is a block diagram of the standards converter. The standardsconverter comprises an input terminal 1 to which an input video signalis supplied. The input terminal is connected to a progressive scanconverter 2 in which the input video fields are converted into videoframes which are supplied to a direct block matcher 3 whereincorrelation surfaces are created. These correlation surfaces areanalysed by a motion vector estimator 4, which derives and suppliesmotion vectors to a motion vector reducer 5, wherein the number ofmotion vectors for each pixel is reduced, before they are supplied to amotion vector selector 6, which also receives an output from theprogressive scan converter 2. Any irregularity in the selection of themotion vectors by the motion vector selector 6 is removed by a motionvector post processor 7, from which the processed motion vectors aresupplied to and control an interpolator 8 which also receives an inputfrom the progressive scan converter 2. The output of the interpolator 8,which is a standards-converted and motion-compensated video signal issupplied to an output terminal 9. Each part of the standards converterand the operation thereof will be described in more detail below.

The progressive scan converter 2 produces output frames at the same rateas the input fields. Thus, referring to FIG. 2 which shows a sequence ofconsecutive lines in a sequence of consecutive fields, the crossesrepresenting lines present in the input fields and the squaresrepresenting interpolated lines, each output frame will contain twicethe number of lines as an input field, the lines alternating betweenlines from the input video signal and lines which have been interpolatedby one of the methods to be described below. The interpolated lines canbe regarded as an interpolated field of the opposite polarity to theinput field, but in the same temporal position.

Progressive scan conversion is preferably carried out, for two mainreasons; firstly, to make the following direct block matching processeasier, and secondly in consideration of the final output video format.These two reasons will now be considered in more detail.

Direct block matching is used to obtain an accurate estimation of thehorizontal and vertical motion between two successive video fields, asdescribed in more detail below. However, due to the interlaced structureof the video signal on which direct block matching is performed,problems can arise.

Consider the image represented by FIG. 3, which indicates a sequence ofsuccessive lines in a sequence of successive fields, the open squaresrepresenting white pixels, the black squares representing black pixels,and the hatched squares representing grey pixels. This, therefore,represents a static picture with a high vertical frequency componentwhich in a HDVS would be 1125/3 cycles per picture height. As this imagehas been sampled by the usual interlace scanning procedure, each fieldappears to contain a static vertical frequency luminance component Y of1125/6 cph, as indicated in FIG. 4. However, the frequency components ineach field are seen to be in antiphase. Attempts to perform direct blockmatching between these two fields will lead to a number of differentvalues for the vertical motion component, all of which are incorrect.This is indicated in FIG. 5, in which the abbreviation LPF means linesper field. From FIG. 5 it is clear that direct block matching will notgive the correct answer for the vertical motion component, whichcomponent should in fact be zero. This is because the direct blockmatching is in fact tracking the alias component of the video signalrather than the actual motion.

Consider now FIG. 6, which depicts the same static image as FIG. 3,except that now each input field has been progressive scan converted toform a frame, the triangles representing interpolated pixels. It can beseen that each frame now contains the same static vertical frequencycomponent as the original input fields, that is 1125/3 cph. Thus, directblock matching between two successive frames can now give the correctvalue for the vertical motion, that is, zero, and the tracking of thevertical alias has been avoided. Moreover, there is the point thatdirect block matching on progressive scan converted frames will resultin a more accurate vertical motion estimate, because the direct blockmatching is being performed on frames which have twice the number oflines.

Concerning consideration of the final output video format, in the caseof the present embodiment, the converted video is supplied via tape toan electron beam recorder, and needs to consist of frames correspondingto the motion picture film rate of 24 frames per second. For thisreason, therefore, the production of progressive scan converted framesis necessary, and moreover the progressive scan converted frames canalso be used as a fall-back in the case where motion compensatedstandards conversion is deemed to be producing unacceptable results, forexample, where the motion is too diverse to be analysed satisfactorily.In that case the use of the nearest progressive scan converted frame asthe required output frame can produce reasonably acceptable results.

Progressive scan conversion can be carried out in a number of ways, suchas by previous field replacement, median filtering in which threespatially consecutive lines are examined (temporally these three lineswill come from two consecutive fields), or a motion compensatedtechnique which utilizes multi-gradient motion detection followed bymulti-direction linear interpolation. However, in the present embodimentthe preferred method is motion adaptive progressive scan conversion, thesteps of which are indicated in the block diagram of FIG. 7. The conceptis to use inter-field interpolation in wholly static picture areas toretain as much vertical information as possible, and to use intra-fieldinterpolation when significant motion is present. This also aids smoothportrayal of motion. In scenes where the motion is somewhere betweenthese two extremes, an estimate of the local motion present in thepicture is made, and this is then used to mix together differentproportions of inter- and intra-field interpolation.

In more detail, the modulus of the frame difference between previous andnext fields is first generated, this being indicated in FIG. 8. Togenerate the required estimates, the modulus inter-frame differencearray from the previous and the next fields is generated at each point:##EQU1## where: Δ_(U) is the unnormalized modulus difference array, and

Y is the luminance array corresponding to the 3D picture.

The modulus of difference is then normalized to adjust for thesignificance of changes in lower luminance areas: ##EQU2## where: Δ_(N)is the normalized modulus difference array

Y is the inter-frame average luminance value

Y(pixel, current line)=(Y (pixel, current line, previous field)+Y(pixel,current line, next field) )/2, and

F(Y) (the normalizing function) is derived as indicated in FIG. 9.

The difference array Δ is then vertically filtered together with theprevious field difference by a three-tap filter (examples ofcoefficients are a quarter, a half, a quarter or zero, unity, zero) toreduce vertical alias problems, and in particular to minimize theproblems encountered with temporal alias. Thus: ##EQU3## where: Δ_(F) isthe filtered normalized difference array, and

C₁ and C₂ are filter coefficients, and 2C₁ +C₂ =1 so that unity dc gainis maintained.

A vertical and horizontal intra-field filter of up to five taps byfifteen taps is then used to smooth the difference values within thecurrent field. In practice, a filter of three taps by three taps issatisfactory. Finally, in order to produce the actual motion estimation,a non-linear mapping function is applied using a function to provide themotion estimate (ME):

    ME (pixel, current line)=γ(spatially filtered Δ.sub.F (pixel, current line) )

The non-linear function γ is derived as shown in FIG. 10, the staticpicture ME is zero, for full motion ME is one, and for intermediatemotions a controlled transition occurs.

To produce an interpolated pixel, the pixels in the missing line arecreated by taking proportions of the surrounding lines as indicated inFIG. 11. The motion estimate ME is then applied to the intra-frameinterpolated value (generated from a two, four, six or preferably eighttap filter), and 1-ME is applied to the inter-field average (oralternatively to a more complex interpolated value), and these aresummed to derive the progressive scan pixel estimate: ##EQU4## where:C₀, C₁, C₂ and C₃ are the intra-frame filter coefficients, and 2(C₀ +C₁+C₂ +C₃)=1 so that unity dc gain is maintained.

This method of progressive scan conversion is found to produce highquality frames from input fields, in particular because a moving objectcan be isolated and interpolated in a different manner to a stationarybackground.

Referring back to FIG. 1, the frames of video derived by the progressivescan converter 2 are used to derive motion vectors. The estimation ofmotion vectors consists of two steps. Firstly, correlation surfaces aregenerated by correlating search blocks from consecutive frames. Then,having obtained these correlation surfaces, they have to be examined todetermine the position or positions at which correlation is best.Several different methods of obtaining a correlation surface exist, thetwo main methods being phase correlation and direct block matching.There are, however, a number of problems associated with the use ofphase correlation, these being very briefly problems relating to thetransform mechanism, the windowing function, the block size and thevariable quality of the contour of the surface produced. In the presentembodiment, therefore, direct block matching is preferred.

Briefly, the direct block matcher 3, with which the present invention isparticularly, but not exclusively, concerned, operates as follows. Twoblocks, respectively comprising a rectangular array of pixels fromconsecutive frames of the progressive scan converted video signal arecorrelated to produce a correlation surface from which a motion vectoris derived.

Referring to FIGS. 12A and 12B, firstly a small block called a searchblock of size 32 pixels by 23 lines is taken from a frame as shown inFIG. 12A. Then a larger block called a search area of size 128 pixels by69 lines is taken from the next frame, as shown in FIG. 12B. The searchblock (SB) is then placed in each possible position (96×46 positions intotal) in the search area (SA) as shown in FIG. 13, and for eachlocation the sum of the absolute difference of pixel luminance levelsbetween the two blocks is calculated. This value is then used as theheight of the correlation surface at the point at which it was derived.It can then be used in conjunction with other similarly derived valuesfor each possible location of the search block in the search area toobtain a correlation surface, an example of which is shown in FIG. 14.For clarity the surface is shown inverted, and as it is in fact theminimum that is required, the required point in FIG. 14 is the mainpeak.

The size of the search block is selected by examining the minimum sizeof an object that may require motion compensation. For PAL625 lines perframe, 50 fields per second signals a search block of 16 pixels by 8lines has been found suitable for tracking a small object withoutallowing any surrounding information not within the object, but stillwithin the search block, to affect the tracking of the object. Thisapproach has therefore been adopted in the present embodiment, bumodified to take account of the different numbers of active pixels perline, active lines per frame, and aspect ratio of a HDVS as comparedwith PAL 625/50. The comparative figures, the HDVS being put first, areas follows; 1920 (720) active pixels per line, 1035 (575) active linesper frame, 3:5.33 (3:4) aspect ratio.

The direct block matcher 3 (FIG. 1) will now be described in more detailwith reference to FIGS. 15 to 17. Broadly, it is configured in hardwareas a series of gate arrays. Thus FIG. 15 shows a pixel accumulationcircuit, a plurality (32) of which are comprised in a line accumulationcircuit shown in FIG. 16, whilst a plurality (23) of the lineaccumulation circuits are comprised in the portion of the direct blockmatcher 3 (FIG. 1) shown in FIG. 17. The complete line accumulationcircuit can readily be formed in a single gate array integrated circuit.The repetitive nature of the overall circuit arrangement helps simplifythe gate array design.

The pixel accumulation circuit of FIG. 15 comprises a subtractor 20, anexclusive-OR gate 21, an adder 22, latch circuits 23 and 24, delays 25and 26, and a horizontal bus 27, interconnected as shown and operatingas will now be described. The reference data consists of serial pixeldata from the current frame, that is the frame in which the search blockis located. The data are thus a sequence, at an appropriate clock rate,of digital luminance sample values. The search data consists of similarserial pixel data, but from the following frame, that is the frame inwhich the search area is located. The subtractor 20 and the exclusive-ORgate 21 together derive the absolute (that is the modulus of the)difference of the pixel luminance levels, respective pair of pixels byrespective pair of pixels, between the search block and the search area.The adder 22, the latch circuits 23 and 24, and the delay 25 togetherform an accumulator controlled by a block width (1/32 clock rate)synchronizing signal, so as to accumulate 32 absolute pixel luminancedifferences by successive additions, to form a sum which is loaded intothe latch circuit 24 when a block synchronizing signal is supplied toits load (LD) terminal, and which is read out onto the horizontal bus 27when, after a delay, the delay 25 supplies a signal to the output enable(OE) terminal of the latch circuit 24. The reference data are alsosupplied directly to the delay 26 to be passed on with a one pixel delayto the next pixel comparison array as will now become apparent.

The line accumulation circuit of FIG. 16 comprises 32 pixel accumulationcircuits P1 to P32 each as shown in FIG. 15, latch circuits 30 and 31,an adder 32, an AND-gate 33, a delay 34 and an output bus 35,interconnected as shown and operating as will now be described. Thepixel accumulation circuits P1 to P32 supply their respective outputs inmultiplex to the horizontal bus 27, and the adder 32 and latch circuit31 together form an accumulator for accumulating respective groups ofthese outputs over the vertical height of a search block, that is 23lines. When a vertical initialize signal is supplied to the outputenable (OE) terminal of the latch circuit 31 the accumulated output issupplied to the output bus 35. The accumulator is cleared down by asignal supplied from the AND-gate 33 to the delay 34, which is a linedelay, and thence by way of the latch circuit 30 to the adder 32.

The portion of the direct block matcher 3 (FIG. 1) shown in FIG. 17comprises 23 line accumulation circuits L1 to L23 each as shown withinthe broken line in FIG. 16, a search range (23 lines+48 pixels) delay40a, a group delay 40b, and 23 line delays 41, interconnected as shown,and operating as will now be described. As before, the reference dataand the search data are supplied as shown, and are passed by the delays40a and 40b respectively to the line accumulation circuit L1. Thereference data are likewise supplied with delays increasingprogressively by one line, to the succeeding line accumulation circuitsL2 to L23, while the search data are supplied with the same delay (dueto the delay 40a) to each of the line accumulation circuits L1 to L23.In this way there is multiplexed to the output bus 35 a group of 32×23absolute pixel luminance differences. Six such groups make up thecorrelation surface for one search block, and six output buses 35 carrythis information. The only difference in the manner of deriving the sixgroups is in the values of the delays 40a and 40b. The values of thedelays are as follows, where L means lines and P means pixels:

    ______________________________________                                        Group 1      40a:23L/48P   40b:23L/64P                                        Group 2      40a:23L/48P   40b:23L/32P                                        Group 3      40a:23L/48P   40b:23L                                            Group 4      40a:23L/48P   40b:64P                                            Group 5      40a:23L/48P   40b:32P                                            Group 6      40a:23L/48P   40b:0                                              ______________________________________                                    

It should be added that there is an argument for using a larger searchblock, since this means that a large object can be tracked. On the otherhand, there exists an argument for using a smaller search block, toprevent a small object being over-shadowed by the effect of a largeobject or background area. Also, however, there is the advantage thatwith small search blocks there is no requirement for the derivation ofmore than one motion vector from each of them. Because having a singlemotion vector is so much easier than having more than one, the presentembodiment starts with a small search block as described above, and thencauses the search block to grow into a bigger search block if nosatisfactory result has been obtained. This then encompasses theadvantages of both a small and a large search block. The criteria for asatisfactory result is set by the motion vector estimator 4 (FIG. 1)referred to in more detail below and which determines the motion vectorfrom a given correlation surface.

This technique of causing the search block to grow is not onlyadvantageous for tracking large objects. It can also help to track themovement of an object having the shape of a regular pattern of aperiodic nature. Thus, consider FIG. 18 where a search block A willmatch up with the search area B at locations V1, V2 and V3, with each ofthem giving a seemingly correct measure of motion. In this case,however, the motion vector estimation, that is the process that actuallyanalyses the correlation surface, will show that good correlation occursin three locations which are collinear. The search block will thereforebe caused to grow horizontally until it is three times its originalwidth, this being the direction in which multiple correlation occurredin this case. The search area will also be correspondingly horizontallyenlarged. As shown in FIG. 19A, with the enlarged search block 3A, thereis only a single correlation point, which correctly relates to themotion of the object.

In this particular case the search block and the search area (FIG. 19B)both have to grow horizontally, because the direction of multiplecorrelation is horizontal. It is equally possible, however, for thesearch block and the search area to grow vertically, or indeed in bothdirections, if the correlation surface suggests it.

It should be noted that block matching cannot be applied to all thesearch blocks in the frame, because in the border area there is notenough room from which a search area can be drawn. Thus, block matchingcannot be effected in the border area of the frame shown hatched in FIG.20. This problem is dealt with by the motion vector reducer 5 (FIG. 1)described in more detail below, which attempts to supply search blocksin this hatched area with appropriate motion vectors.

From the correlation surface (FIG. 17) generated for each search blockin a frame the motion vector estimator 4 (FIG. 1) deduces the likelyinter-frame motion between the search block and its corresponding searcharea. It should again be mentioned that for clarity all diagrams ofcorrelation surfaces are shown inverted, that is, such that a minimum isshown as a peak.

The motion vector estimator 4 (FIG. 1) uses motion vector estimationalgorithms to detect the minimum point on each correlation surface. Thisrepresents the point of maximum correlation between the search block andthe search area, and hence indicates the probable motion between them.The displacement of this minimum on the correlation surface with respectto the origin, in this case the centre of the surface, is a directmeasurement, in terms of pixels per frame, of the motion. For thesimplest case, where the correlation surface contains a single, distinctminimum, the detection of the minimum point on the correlation surfaceis sufficient to determine accurately the motion between the searchblock and the search area. As previously mentioned, the use of smallsearch blocks improves the detection of motion and the accuracy ofmotion estimation, but unfortunately small single search blocks areunable to detect motion in a number of circumstances which will now bedescribed.

FIGS. 21A and 21B show an object with motion vectors (5, 0) straddlingthree search blocks 1A, 2A and 3A in a frame (t). When the search blocks1A and 3A are correlated with respective search areas (1B and 3B) in thenext frame (t+1) a correlation surface shown in FIG. 22 results showinga minimum at (5, 0). (This assumes a noiseless video source). However,when the search block 2A is correlated with its respective search area2B, the correlation surface shown in FIG. 23 is produced, in which thesearch block 2A correlates with the search area 2B at every point in they-axis direction. There is therefore no single minimum in thecorrelation surface, and hence the motion between the search block 2Aand the search area 2B cannot be determined.

However, now consider the situation if the search block 2A is grown suchthat it encompasses all three of the original search blocks 1A, 2A and3A. When the grown search block 2A is correlated with a search areacovering the original search areas 1B, 2B and 3B, the resultingcorrelation surface is as shown in FIG. 24. This shows a single minimumat (5, 0) indicating the correct motion of the original search block 2A.This example illustrates the need for some unique feature in the sourcevideo, in order accurately to detect motion. Thus, the search blocks 1Aand 3A both had unique vertical and horizontal features, that is theedges of the object, and hence motion could be determined. In contrast,the search block 2A had a unique vertical feature, but no uniquehorizontal feature, and hence horizontal motion could not be determined.However, by growing the search block until it encompasses a uniquefeature both horizontally and vertically, the complete motion for thatsearch block can be determined. Moreover, it can be shown that growingthe search block is beneficial when noise in the source video isconsidered.

A further example will now be considered with reference to FIG. 25. Thisshows a correlation surface for a search block where the motion vectoris (5, 3). However, due to the numerous other correlations which havetaken place between the search block and the search area, the truemotion is difficult to detect. An example of source video which mightproduce such a correlation surface would be a low contrast tree movingwith the wind. It is now assumed that the search block and the searcharea are grown. The growing can take place in the horizontal direction,as in the previous example, or in the vertical direction, or in bothdirections. Assuming that the neighbouring search blocks have the samemotion, the mean effect on the resulting correlation surface will be toincrease the magnitude of the minima at (5, 3) by a greater proportionthan the magnitude of the other correlation peaks. This is shown in FIG.26, which indicates that it is then easier to detect the correct motionvector.

The way in which search blocks are grown will now be further consideredwith reference to FIG. 21. Here it was required to grow the area of thesearch block 2A to encompass the areas of the search blocks 1A and 3A,and to produce the resulting correlation surface. In fact, the resultingcorrelation surfaces are produced directly by adding together theelements of the three correlation surfaces corresponding to the searchblocks 1A, 2A and 3A. In effect, if each correlation surface isconsidered as a matrix of point magnitudes, then the correlation surfaceof the enlarged search block 2A is the matrix addition of thecorrelation surface of the original search blocks 1A, 2A and 3A.

The area of the search block 2A could also be grown vertically by addingcorrelation surfaces of the search blocks above and below, whilst if thesearch block 2A is to be grown both horizontally and vertically, thenthe four neighbouring diagonal correlation surfaces have to be added aswell. From this it will be seen that the actual process of growing asearch block to encompass neighbouring search blocks is relatively easy,the more difficult process being to decide when growing should takeplace, and which neighbouring search blocks should be encompassed.Basically, the answer is that the area of the search blocks should begrown until a good minimum or good motion vector is detected. It istherefore necessary to specify when a motion vector can be taken to be agood motion vector, and this can in fact be deduced from the examplesgiven above.

In the example described with reference to FIGS. 21 to 24, it wasnecessary to grow the search block horizontally in order to encompass aunique horizontal feature of the object, and hence obtain a singleminimum. This situation was characterized by a row of identical minimaon the correlation surface of FIG. 23, and a single minimum on thecorrelation surface of FIG. 24. From this the first criteria for a goodminimum can be obtained; a good minimum is the point of smallestmagnitude on the correlation surface for which the difference between itand the magnitude of the next smallest point exceeds a given value. Thisgiven value is known as the threshold value, and hence this test isreferred to herein as the threshold test.

It should be noted that the next smallest point is prevented fromoriginating from within the bounds of a further test, described below,and referred to herein as the rings test. In the case of a rings testemploying three rings, the next smallest point is prevented fromoriginating from a point within three pixels of the point in question.In the example of FIGS. 21 to 24, the correlation surface of FIG. 23would have failed the threshold test; the search area 2A is thereforegrown and, given a suitable threshold value, the correlation surface ofFIG. 24 will pass the threshold test.

The threshold test can also be used to cause growing in the exampledescribed above with reference to FIGS. 25 and 26. Prior to growing thesearch block, the correct minimum is undetectable, due to the closelysimilar magnitudes of the surrounding points. Given a suitable thresholdvalue, however, the correlation surface will fail the threshold test,and the search block will be grown. As a result, it will then bepossible to detect the minimum among the other spurious points.

It will be seen that the use of a threshold is a subjective test, butthe correct threshold for the correlation surface under test can beselected by normalizing the threshold as a fraction of the range ofmagnitudes within the correlation surface. This also lessens the effectof, for example the contrast of the video source.

The rings test, referred to briefly above, and which is far lesssubjective, will now be further described. The basis of the rings testis to assume that a good minimum (or maximum) will have points ofincreasing (or decreasing) magnitudes surrounding it. FIG. 27illustrates this assumption, showing a minimum at (0, 0) where thesurrounding three rings of points have decreasing mean magnitude. Thisis as opposed to the correlation surface shown in FIG. 28, where therings, and in particular the second inner-most ring, are not ofdecreasing mean magnitude.

In this case the criteria for a good minimum as defined by the ringstest, is that the average slope is monotonic. Therefore for apre-defined number of rings of points surrounding the minimum inquestion, the mean magnitude of each ring when moving from the innermostring outwards, must be greater than that of the previous ring. Returningagain to the example described with reference to FIGS. 21 to 24 it willbe seen from FIGS. 23 and 24 that the correlation surface of FIG. 23would have failed the rings test, but that the correlation surface ofFIG. 24 would have passed the rings test. Since the rings test comparesmean, and not absolute, magnitudes, it is far less subjective than thethreshold test, and indeed the only variable in the rings test is thenumber of rings considered.

Having described the mechanism for growing a search block, it is nownecessary to consider how by examining the shape of the correlationsurface it is possible to determine the most effective direction inwhich the search block should grow.

Referring again to FIG. 23, this correlation surface resulted wherethere was a unique vertical feature, but no unique horizontal feature.This is mirrored in the correlation surface by the minimum runninghorizontally across the correlation surface, due to the multiplecorrelations in this direction. From this it can be deduced that thesearch block should be grown horizontally. Conversely, should a line ofmultiple correlations run vertically, this would indicate the need togrow the search block vertically, whilst a circular collection ofmultiple correlations would indicate a need to grow the search blockboth horizontally and vertically.

Using this criteria, a quantative measure of the shape of thecorrelation surface is required in order to determine in which directionthe search block should be grown. This measure is determined as follows.Firstly, a threshold is determined. Any point on the correlation surfacebelow the threshold is then considered. This threshold, like that usedin the threshold test, is normalized as a fraction of the range ofmagnitudes within the correlation surface. Using this threshold, thepoints on the correlation surface are examined in turn in four specificsequences. In each, the point at which the correlation surface valuefalls below the threshold is noted. These four sequences are illustrateddiagrammatically in FIG. 29 in which the numbers 1, 2, 3 and 4 at thetop, bottom, left and right refer to the four sequences, and the hatchedarea indicates points which fall below the threshold:

Sequence 1

Search from the top of the correlation surface down for a point A whichfalls below the threshold.

Sequence 2

Search from the bottom of the correlation surface up for a point C whichfalls below the threshold.

Sequence 3

Search from the left of the correlation surface to the right for a pointD which falls below the threshold.

Sequence 4

Search from the right of the correlation surface to the left for a pointB which falls below the threshold.

The locations of the four resulting points A, B, C and D are used tocalculate the two dimensions X and Y indicated in FIG. 29, thesedimensions X and Y indicating the size of the hatched area containingthe points falling below the threshold value. Hence from the dimensionsX and Y, it can be deduced whether the shape is longer in the x ratherthan the y direction, or vice versa, or whether the shape isapproximately circular. A marginal difference of say ten percent isallowed in deducing the shape, that is, the dimension X must be aminimum of ten percent greater than the dimension Y for the shape to beconsidered to be longer in the x direction. Similarly for the ydirection. If the dimensions X and Y are within ten percent of eachother, then the shape is considered to be circular, and the search blockis grown in both directions. In the example of FIG. 29 the dimension Xis greater than the dimension Y, and hence the search block is grown inthe x or horizontal direction.

The growing of the search block continues until one or more growthlimitations is reached. These limitations are: that the minimum in thecorrelation surface passes both the threshold test and the rings test;that the edge of the video frame is reached; or that the search blockhas already been grown a predetermined number of times horizontally andvertically. This last limitation is hardware dependent. That is to say,it is limited by the amount of processing that can be done in theavailable time. In one specific embodiment of apparatus according to thepresent invention, this limit was set at twice horizontally and oncevertically.

If the minimum in the correlation surface passes both the threshold testand the rings test, then it is assumed that a good motion vector hasbeen determined, and can be passed to the motion vector reducer 5 (FIG.1). However, if the edge of the frame is reached or the search block hasalready been grown a predetermined number of times both horizontally andvertically, then it is assumed that a good motion vector has not beendetermined for that particular search block, and instead of attemptingto determine a good motion vector, the best available motion vector isdetermined by weighting.

The correlation surface is weighted such that the selection of the bestavailable motion vector is weighted towards the stationary, that is thecentre, motion vector. This is for two reasons, firstly, if the searchblock, even after growing, is part of a large plain area of sourcevideo, it will not be possible to detect a good motion vector. However,since the source video is of a plain area, a stationary motion vectorwill lead to the correct results in the subsequent processing. Secondly,weighting is designed to reduce the possibility of a seriously wrongmotion vector being passed to the motion vector reducer 5 (FIG. 1). Thisis done because it is assumed that when a good motion vector cannot bedetermined, a small incorrect motion vector is preferable to a largeincorrect motion vector.

FIGS. 30A and 30B show an example of how the weighting function can beapplied to the correlation surface. In this example, the weight appliedto a given point on the correlation surface is directly proportional tothe distance of that point from the stationary, centre motion vector.The magnitude of the point on the correlation surface is multiplied bythe weighting factor. For example, the gradient of the weightingfunction may be such that points plus or minus 32 pixels from thecentre, stationary motion vector are multiplied by a factor of three. Inother words, as shown in FIG. 30B, where the centre, stationary motionvector is indicated by the black circle, the weighting function is aninverted cone which is centred on the centre, stationary motion vector.

After the correlation surface has been weighted, it is again passedthrough the threshold test and the rings test. If a minimum which passesboth these tests is determined, then it is assumed that this is a goodmotion vector, and it is flagged to indicate that it is a good motionvector, but that weighting was used. This flag is passed, together withthe motion vector to the motion vector reducer 5 (FIG. 1). If on theother hand, neither a good motion vector nor a best available motionvector can be determined, even after weighting, then a flag is set toindicate that any motion vector passed to the motion vector reducer 5(FIG. 1) for this search block is a bad motion vector. It is necessaryto do this because bad motion vectors must not be used in the motionvector reduction process, but must be substituted as will be describedbelow.

Thus, in summary, the operation of the motion vector estimator 4(FIG. 1) is to derive from the correlation surface generated by thedirect block matcher 3 (FIG. 1), the point of best correlation, that isthe minimum. This minimum is then subjected to the threshold test andthe rings test, both of which the minimum must pass in order for it tobe considered to represent the motion of the search block. It should,incidentally, be noted that the threshold used in the threshold test andthe rings test may be either absolute values or fractional values. Ifthe minimum fails either test, then the search block is grown, a newminimum is determined, and the threshold test and the rings testre-applied. The most effective direction in which to grow the searchblock is determined from the shape of the correlation surface.

Referring initially to FIG. 1, the process of motion vector reductionwill now be described. Using a HDVS, each search block is assumed to be32 pixels by 23 lines, which can be shown to lead to a possible maximumof 2451 motion vectors. The choice of the search block size is acompromise between maintaining resolution and avoiding an excessiveamount of hardware. If all these motion vectors were passed to themotion vector selector 6, the task of motion vector selection would notbe practicable, due to the amount of processing that would be required.To overcome this problem, the motion vector reducer 5 is providedbetween the motion vector estimator 4 and the motion vector selector 6.The motion vector reducer 5 takes the motion vectors that have beengenerated by the motion vector estimator 4 and presents the motionvector selector 6 with only, for example, four motion vectors for eachsearch block in the frame, including those in border regions, ratherthan all the motion vectors derived for that frame. The effect of thisis two-fold. Firstly, this makes it much easier to choose the correctmotion vector, so long as it is within the group of four motion vectorspassed to the motion vector selector 6. Secondly, however, it also meansthat if the correct motion vector is not passed as one of the four, thenthe motion vector selector 6 is not able to select the correct one. Itis therefore necessary to try to ensure that the motion vector reducer 5includes the correct motion vector amongst those passed to the motionvector selector 6. It should also be mentioned that although four motionvectors are passed by the motion vector reducer 5 to the motion vectorselector 6, only three of these actually represent motion, the fourthmotion vector always being the stationary motion vector which isincluded to ensure that the motion vector selector 6 is not forced intoapplying a motion vector representing motion to a stationary pixel.Other numbers of motion vectors can be passed to the motion vectorselector 6, for example, in an alternative embodiment four motionvectors representing motion and the stationary motion vector may bepassed.

Hereinafter the term `sample block` refers to a block in a frame ofvideo in which each pixel is offered the same four motion vectors by themotion vector reducer 5. Thus, a sample block is the same as a searchblock before the search block has been grown. As shown in FIG. 31, in aframe of video the initial positions of the sample blocks and the searchblocks are the same.

The motion vector reducer 5 (FIG. 1) receives the motion vectors and theflags from the motion vector estimator 4 (FIG. 1) and determines thequality of the motion vectors by examining the flags. If the motionvector was not derived from an ambiguous surface, that is there is ahigh degree of confidence in it, then it is termed a good motion vector,but if a certain amount of ambiguity exists, then the motion vector istermed a bad motion vector. In the motion vector reduction process, allmotion vectors classed as bad motion vectors are ignored, because it isimportant that no incorrect motion vectors are ever passed to the motionvector selector 6 (FIG. 1), in case a bad motion vector is selectedthereby. Such selection would generally result in a spurious dot in thefinal picture, which would be highly visible.

Each of the motion vectors supplied to the motion vector reducer 5(FIG. 1) was obtained from a particular search block, and hence aparticular sample block (FIG. 31), the position of these being notedtogether with the motion vector. Because any motion vectors which havebeen classed as bad motion vectors are ignored, not all sample blockswill have a motion vector derived from the search block at thatposition. The motion vectors which have been classed as good motionvectors, and which relate to a particular search block, and hence aparticular sample block, are called local motion vectors, because theyhave been derived in the area from which the sample block was obtained.In addition to this, another motion vector reduction process counts thefrequency at which each good motion vector occurs, with no account takenof the actual positions of the search blocks that were used to derivethem. These motion vectors are then ranked in order of decreasingfrequency, and are called common motion vectors. In the worst case onlythree common motion vectors are available and these are combined withthe stationary motion vector to make up the four motion vectors to bepassed to the motion vector selector 6 (FIG. 1). However, as there areoften more than three common motion vectors, the number has to bereduced to form a reduced set of common motion vectors referred to asglobal motion vectors.

A simple way of reducing the number of common motion vectors is to usethe three most frequent common motion vectors and disregard theremainder. However, the three most frequent common motion vectors areoften those three motion vectors which were initially within plus orminus one pixel motion of each other vertically and/or horizontally. Inother words, these common motion vectors were all tracking the samemotion with slight differences between them, and the other common motionvectors, which would have been disregarded, were actually trackingdifferent motions.

In order to select the common motion vectors which represent all or mostof the motion in a scene, it is necessary to avoid choosing globalmotion vectors which represent the same motion. Thus, the strategyactually adopted is first to take the three most frequently occurringcommon motion vectors and check to see if the least frequent among themis within plus or minus one pixel motion vertically and/or plus or minusone pixel motion horizontally of either of the other two common motionvectors. If it is, then it is rejected, and the next most frequentlyoccuring common motion vector is chosen to replace it. This process iscontinued for all of the most frequently occurring common motion vectorsuntil there are either three common motion vectors which are not similarto each other, or until there are three or less common motion vectorsleft. However, if there are more than three common motion vectors left,then the process is repeated this time checking to see if the leastfrequent among them is within plus or minus two pixel motion verticallyand/or plus or minus two pixel motion horizontally of another, and so onat increasing distances if necessary. These three common motion vectorsare the required global motion vectors, and it is important to note thatthey are still ranked in order of frequency.

When considering the motion vector reduction process and the sampleblocks of a frame of video, it is necessary to look at three differenttypes of sample blocks. These types are related to their actual positionin a frame of video, and are shown in FIG. 32 as regions. Region Acomprises sample blocks which are totally surrounded by other sampleblocks and are not near the picture boundary. Region B contains sampleblocks which are partially surrounded by other sample blocks and are notnear the picture boundary. Finally, region C contains sample blockswhich are near the picture boundary. The motion vector reductionalgorithm to be used for each of these regions is different. Thesealgorithms will be described below, but firstly it should be reiteratedthat there exist good motion vectors for some of the sample blocks inthe frame of video, and additionally there are also three global motionvectors which should represent most of the predominant motion in thescene. A selection of these motion vectors is used to pass on threemotion vectors together with the stationary motion vector for eachsample block.

FIG. 33 illustrates diagrammatically motion vector reduction in theregion A. This is the most complex region to deal with, because it hasthe largest number of motion vectors to check. FIG. 33 shows a centralsample block which is hatched, surrounded by other sample blocks a to h.Firstly, the locally derived motion vector is examined to see if it wasclassed as a good motion vector. If it was, and it is also not the sameas the stationary motion vector, then it is passed on. However, if itfails either of these tests, it is ignored. Then the motion vectorassociated with the sample block d is checked to see if it was classedas a good motion vector. If it was, and if it is neither the same as anymotion vector already selected, nor the same as the stationary motionvector, then it too is passed on. If it fails any of these tests then ittoo is ignored. This process then continues in a similar manner in theorder e, b, g, a, h, c and f. As soon as three motion vectors, notincluding the stationary motion vector, have been obtained, then thealgorithm stops, because that is all that is required for motion vectorselection for that sample block. It is, however, possible for all theabove checks to be carried out without three good motion vectors havingbeen obtained. If this is the case, then the remaining spaces are filledwith the global motion vectors, with priority being given to the morefrequent global motion vectors.

FIG. 34 illustrates motion vector reduction in the region B. Sampleblocks in the region B are the same as those in the region A, exceptthat they are not totally surrounded by other sample blocks. Thus theprocess applied to these sample blocks is exactly the same as those forthe region A, except that it is not possible to search in all thesurrounding sample blocks. Thus as seen in FIG. 34, it is only possibleto check the motion vectors for the sample blocks a to e, and anyremaining spaces for motion vectors are filled, as before, with globalmotion vectors. Likewise, if the hatched sample block in FIG. 34 weredisplaced two positions to the left, then it will be seen that therewould only be three adjacent surrounding blocks to be checked beforeresorting to global motion vectors.

FIG. 35 illustrates motion vector reduction in the region C. This is themost severe case, because the sample blocks neither have a locallyderived motion vector nor do they have many surrounding sample blockswhose motion vectors could be used. The simplest way of dealing withthis problem is simply to give the sample blocks in the region C theglobal motion vectors together with the stationary motion vector.However, this is found to produce a block-like effect in the resultingpicture, due to the sudden change in the motion vectors presented forthe sample blocks in the region C compared with adjoining sample blocksin the region B. Therefore a preferred strategy is to use for the sampleblocks in the region C the sample motion vectors as those used forsample blocks in the region B, as this prevents sudden changes.Preferably, each sample block in the region C is assigned the samemotion vectors as that sample block in the region B which is physicallynearest to it. Thus, in the example of FIG. 35, each of the hatchedsample blocks in the region C would be assigned the same motion vectorsas the sample block a in the region B, and this has been found to giveexcellent results.

Referring again to FIG. 1, the purpose of the motion vector selector 6is to assign one of the four motion vectors supplied thereto to eachindividual pixel within the sample block. In this way the motion vectorscan be correctly mapped to the outline of objects. The way in which thisassignment is effected is particularly intended to avoid the possibilityof the background surrounding fine detail from producing a better matchthan that produced by the correct motion vector. To achieve this themotion vector selection process is split into two main stages. In thefirst stage, motion vectors are produced for each pixel in the inputframes. In other words, there is no attempt to determine the motionvector values for pixels at the output frame positions. The second stageuses the motion vector values produced by the first stage to determinethe motion vector value for each pixel in the output frame.

Referring now to FIG. 36, each pixel of the input frame 2 is tested forthe best luminance value match with the previous and following inputframes 1 and 3 of video data, using each of the four motion vectorssupplied. The pixel luminance difference is determined as: ##EQU5##where: P1_(nm) is the luminance value of a frame 1 pixel within a 4×4block of pixels surrounding the pixel whose location is obtained bysubtracting the coordinates of the motion vector being tested from thelocation of the pixel being tested in frame 2

P2_(nm) is the luminance value of a frame 2 pixel within a 4×4 block ofpixels surrounding the pixel being tested

P3_(nm) is the luminance value of a frame 3 pixel within a 4×4 block ofpixels surrounding the pixel whose location is obtained by adding thecoordinates of the motion vector being tested to the location of thepixel being tested in frame 2

The minimum pixel difference then indicates the best luminance match andtherefore the correct motion vector applicable to the pixel beingtested. If the correct motion vector is not available, or there areuncovered or covered areas, referred to in more detail below, then agood match may not occur.

The indication of a poor match is achieved when the average pixeldifference within the block of pixels being used is above a certainthreshold. This threshold is important, because high frequency detailmay produce a poor match even when the correct motion vector is tested.The reason for this poor match is the possibility of a half pixel errorin the motion vector estimate. To determine what threshold shouldindicate a poor match, it is necessary to relate the threshold to thefrequency content of the picture within the block of data whichsurrounds the pixel for which the motion vector is required. To achievethis, an auto-threshold value is determined where the threshold valueequals half the maximum horizontal or vertical pixel luminancedifference about the pixel being tested. To ensure that the thresholdvalue obtained is representative of the whole block of data which iscompared, an average value is obtained for the four central pixels of a4×4 block used.

Referring to FIG. 38, which shows a 4×4 block, the required thresholdvalue T is given by:

    T=(T1+T2+T3+T4)/8

where T3, for example, is determined as indicated in FIG. 39 as equal tothe maximum of the four pixel luminance difference values comprising:

    the two vertical differences |B2-B3| and |B4-B3|,

    and

    the two horizontal differences |A3-B3| and |C3-B3|

In this way a frame of motion vectors is obtained for input frame 2, andin a similar manner a frame of motion vectors is obtained for inputframe 3 as indicated in FIG. 37.

Apart from scene changes, it is the phenomenon of uncovered/coveredsurfaces that causes a mis-match to occur in the above first stage ofmotion vector selection. If an object, say a car, drives into a tunnel,then the car has become covered, while when it drives out, the car isuncovered. If the part of the car that was uncovered in frames 1 and 2is covered in frames 3 and 4, then the basic vector selection process isnot able to determine the correct vector. Moreover, whilst the car goinginto the tunnel becomes covered, the road and objects behind the car arebeing uncovered. Likewise the car leaving the tunnel is being uncovered,but the road and objects behind the car are being covered. In generaltherefore both covered and uncovered objects will exist at the sametime. The end of a scene will also have a discontinuation of motion thatis similar to an object becoming covered. In an attempt to determine amotion vector even in such circumstances, the luminance value blockmatch is reduced to a two frame match, instead of the three frame matchof FIGS. 36 and 37. The frame that the motion vectors are required for(say frame 2) is block-matched individually to the previous and the nextframe (frame 1 and frame 3 respectively, in the case of frame 2), usingthe four motion vectors supplied. The motion vector which produces thebest match is chosen as the motion vector applicable to the pixel beingtested. In this case, however, a flag is set to indicate that only a twoframe match was used.

Particularly with integrating type television cameras, there will besituations where no match occurs. If an object moves over a detailedbackground, then an integrating camera will produce unique portions ofpicture where the leading and trailing edges of the object are mixedwith the detail of the background. In such circumstances, even the twoframe match could produce an average pixel difference above thethreshold value. In these cases the motion vector value is set to zero,and an error flag is also set.

The second stage of motion vector selection makes use of the two framesof motion vectors, derived by the first stage. One frame of motionvectors (input frame 2) is considered to be the reference frame, and thefollowing frame to this (input frame 3) is also used. The output frameposition then exists somewhere between these two frames of motionvectors. Referring to FIG. 40, for each output pixel position the fourpossible motion vectors associated with the sample block of input frame2, are tested. A line drawn through the output pixel position at theangle of the motion vector being tested will point to a position on boththe input frame 2 and the input frame 3. In the case of odd value motionvectors, for example, 1, 3 and 5, a point midway between two input framepixels would be indicated in the case where the output frame isprecisely half way between the input frames 1 and 2. To allow for thisinaccuracy, and also to reduce the sensitivity to individual pixels, a3×3 block of motion vectors is acquired for each frame, centred on theclosest pixel position. In effect a block-match is then performedbetween each of the two 3×3 blocks of motion vectors and a blockcontaining the motion vector being tested. The motion vector differenceused represents the spatial difference of the two motion vector valuesas given by: ##EQU6## where: x1 and y1 are the Cartesian coordinates ofthe motion vector in one of the blocks

x2 and y2 are the Cartesian coordinates of the motion vector beingtested

An average vector difference per pixel is produced as a result of theblock match.

A motion vector match is first produced as above using only motionvector values which were calculated using three input frames; that is,input frames 1, 2 and 3 for input frame 2 (FIG. 36), and input frames 2,3 and 4 for input frame 3 (FIG. 37), and the result is scaledaccordingly. Preferably there are at least four usable motion vectors inthe block of nine. When both the motion vector block of frame 2 andframe 3 can be used, the motion vector difference values are made up ofhalf the motion vector difference value from frame 2 plus half themotion vector difference value from frame 3. Whichever motion vectorproduces the minimum motion vector difference value using the abovetechnique is considered to be the motion vector applicable to the outputpixel being tested. If the motion vector difference value produced bythe three frame match input motion vector (FIGS. 36 and 37) is greaterthan unity, then a covered or uncovered surface has been detected, andthe same process is repeated, but this time ignoring the error flags.That is, the motion vector values which were calculated using two inputframes are used. Theoretically this is only necessary foruncovered/covered surfaces, although in fact improvements can beobtained to the picture in more general areas.

If after both of the above tests have been performed, the minimum motionvector match is greater than two, the motion vector value is set tozero, and an error flag is set for use by the motion vector postprocessor 7 (FIG. 1).

Following motion vector selection, there will almost certainly be in anyreal picture situation, some remaining spurious motion vectorsassociated with certain pixels. FIGS. 41 to 46 show what are taken to bespurious motion vectors, and in each of these figures the trianglesrepresent pixels having associated therewith the same motion vectors,whilst the stars represent pixels having associated therewith motionvectors different those associated with the surrounding pixels, and thecircle indicates the motion vector under test.

FIG. 41 shows a point singularity where a single pixel has a motionvector different from those of all the surrounding pixels.

FIG. 42 shows a horizontal motion vector impulse, where threehorizontally aligned pixels have a motion vector different from those ofthe surrounding pixels.

FIG. 43 shows a vertical motion vector impulse where three verticallyaligned pixels have a motion vector different from those of thesurrounding pixels.

FIG. 44 shows a diagonal motion vector impulse where three diagonallyaligned pixels have a motion vector different from those of all thesurrounding pixels.

FIG. 45 shows a horizontal plus vertical motion vector impulse, wherefive pixels disposed in an upright cross have a motion vector differentfrom those of all the surrounding pixels.

FIG. 46 shows a two-diagonal motion vector impulse where five pixelsarranged in a diagonal cross have a motion vector different from thoseof all the surrounding pixels.

It is assumed that pixel motion vectors which fall into any of the abovesix categories do not actually belong to a real picture, and are adirect result in of an incorrect motion vector selection. If such motionvectors were used during the interpolation process, then they would belikely to cause dots on the final output picture, and it is thereforepreferable that such motion vectors be identified and eliminated. Thisis done using an algorithm which will detect and flag all of the abovemotion vector groupings.

The algorithm uses a two-pass process, with each pass being identical.The need for two passes will become apparent. FIG. 47, to whichreference is made, shows an array of pixels, all those marked with atriangle having the same motion vector associated therewith. The blockof nine pixels in the centre has motion vectors designated vector 1 tovector 9 associated therewith, which motion vectors may or may not bethe same. Vector 5 is the motion vector under test.

In the first pass, vector 5 is checked to determine whether it is thesame as, or within a predetermined tolerance of:

firstly vector 1 or vector 3 or vector 7 or vector 9

and secondly vector 2 or vector 4 or vector 6 or vector 8

This checks to see if vector 5 is the same as at least one of itshorizontal or vertical neighbours, and the same as at least one of itsdiagonal neighbours. If this is not the case, then a flag to set toindicate that pixel 5 is bad.

The first pass will flag as bad those motion vectors relating to pointsingularities, horizontal motion vector impulses, vertical motion vectorimpulses, diagonal motion vector impulses and two diagonal motion vectorimpulses (FIGS. 41 to 44 and 46), but not the motion vectorscorresponding to horizontal plus vertical motion vector impulses (FIG.45) for which pass 2 is required. The second pass checks for exactly thesame conditions as in the first pass, but in this case motion vectorswhich have already been flagged as bad are not included in thecalculation. Thus, referring to FIG. 45, after the first pass only thecentre motion vector is flagged as bad, but after the second pass allfive of the motion vectors disposed in the upright cross are flagged asbad.

Having identified the bad motion vectors, it is then necessary to repairthem, this also being effected by the motion vector post processor 7(FIG. 1). Although various methods such as interpolation or majorityreplacement can be used, it is has been found that in practice simplereplacement gives good results. This is effected as follows (and itshould be noted that the `equals` signs mean not only exactly equal to,but also being within a predetermined tolerance of): If vector 5 isflagged as bad then it is replaced with:

vector 4 if (vector 4 equals vector 6)

else with vector 2 if (vector 2 equals vector 8)

else with vector 1 if (vector 1 equals vector 9)

else with vector 3 if (vector 3 equals vector 7)

else do nothing

Referring again to FIG. 1, the finally selected motion vector for eachpixel is supplied by the motion vector post processor 7 to theinterpolator 8, together with the progressive scan converted frames at60 frames per second from the progressive scan converter 2. Theinterpolator 8 is of relatively simple form using only two progressivescan converted frames, as indicated in FIG. 48. Using the temporalposition of the output frame relative to successive input frames, frame1 and frame 2, and the motion vector for the pixel in the output frame,the interpolator 8 determines in known manner which part of the firstframe should be combined with which part of the second frame and withwhat weighting to produce the correct output pixel value. In otherwords, the interpolator 8 adaptively interpolates along the direction ofmovement in dependence on the motion vectors to produce motioncompensated progressive scan frames corresponding to 24 frames persecond. Although the motion vectors have been derived using onlyluminance values of the pixels, the same motion vectors are used forderiving the required output pixel chrominance values. An 8×8 array ofpixels are used from each frame to produce the required output. Thus theinterpolator 8 is a two-dimensional, vertical/horizontal, interpolatorand the coefficients used for the interpolator 8 may be derived usingthe Remez exchange algorithm which can be found fully explained in`Theory and Application of Digital Signal Processing`, Lawrence RRabiner, Bernard Gold. Prentice-Hall Inc., pages 136 to 140 and 227.

FIGS. 48A, 48B and 48C show diagrammatically the interpolation performedby the interpolator 8 (FIG. 1) for three different cases. The firstcase, shown in FIG. 48A, is where there are no uncovered or coveredsurfaces, the second case, shown in FIG. 48B, is where there is acovered surface, and the third case, shown in FIG. 48C, is where thereis an uncovered surface. In the case of a covered surface, theinterpolation uses only frame 1, whilst in the case of an uncoveredsurface, the interpolation uses only frame 2.

Provision can be made in the interpolator 8 to default to non-motioncompensated interpolation, in which case the temporally nearestprogressive scan converted frame is used.

Although illustrative embodiments of the invention have been describedin detail herein with reference to the accompanying drawings, it is tobe understood that the invention is not limited to those preciseembodiments, and that various changes and modifications can be effectedtherein by one skilled in the art without departing from the scope andspirit of the invention as defined by the appended claims.

I claim:
 1. A motion compensated video standards converter forconverting an input video signal having a first standard format to amotion compensated video signal having a second standard format, saidconverter comprising:progressive scan converter means for receiving saidinput video signal having said first standard format and for convertingfields of said input video signal to video signal progressive scanframes; comparator means coupled to said progressive scan convertermeans for comparing blocks in a first progressive scan frame of saidvideo signal with a plurality of blocks in the following progressivescan frame of said video signal, said comparator means deriving motionvectors which represent the motion of the content of the respectiveblocks compared between said first frame and said following frame; andinterpolator means for interpolating said scan frames from saidprogressive scan converter means in dependence on said motion vectors toproduce said motion compensated video signal having said second standardformat.
 2. A motion compensated video standards converter as set forthin claim 1, in which said comparator means includes means for seriallysupplying digital pixel luminance data of the first frame and thefollowing frame to a gate array means for continuous comparison of theluminance content of the respective blocks compared between said firstframe and said following frame.
 3. A motion compensated video standardsconverter as set forth in claim 1, in which each of said blocks in saidfirst frame is a search block comprising a rectangular array of pixelshaving a luminance content, and in which said comparator means comparessaid luminance content of said search block with that of similar-sizedblocks in each possible position in a search area in said followingframe, said search area comprising a rectangular array of pixels andbeing larger than said search block.
 4. A motion compensated videostandards converter for converting an input video signal having a firststandard format to a motion compensated video signal having a secondstandard format, said converter comprising:progressive scan convertermeans for receiving said input video signal having said first standardformat and for converting fields of said input video signal toprogressive scan frames by motion adaptive line interpolating saidfields of said input video signal; comparator means coupled to saidprogressive scan converter means for serially receiving digital pixelluminance data of a first scan frame and of the following scan frame,said comparator means comparing the luminance content of blocks in saidfirst scan frame with a plurality of blocks in said following scan framefor deriving motion vectors representing the motion between said firstscan frame and said following scan frame; and interpolator means forinterpolating said scan frames from said progressive scan convertermeans in dependence on said motion vectors to produce said motioncompensated video signal having said second standard format.
 5. A methodof deriving motion vectors representing motion between respectivecontents of successive fields or frames of a video signal, said methodincluding the steps of: comparing blocks in a first field or frame ofsaid video signal with a plurality of blocks in the following field orframe of said video signal in integrated circuit gate array means andderiving said motion vectors in accordance with the comparison betweensaid blocks in said first field or frame and said plurality of blocks insaid following field or frame, said motion vectors representing saidmotion of the content of the respective blocks compared between saidfirst field or frame and said following field or frame.
 6. A methodaccording to claim 5, in which said comparing step comparing comprisesgenerating a correlation surface for the respective blocks in said firstfield or frame, said correlation surface representing the differencebetween the content of a block in said first field or frame and thecontent of each of said blocks in said following field or frame withwhich said block in said first field or frame has been compared,locating a minimum in said correlation surface, and deriving a motionvector corresponding to said minimum.
 7. A method according to claim 5,in which each of said blocks in said first field or frame is a searchblock comprising a rectangular array of pixels having a luminancecontent, and in which said comparing step includes comparing the digitalluminance content of said search block with that of similar-sized blocksin each possible position in a search area in said following field orframe, said search area comprising a rectangular array of pixels andbeing larger than said search block.
 8. A method according to claim 5,in which said successive fields or frames are converted to progressivescan frames by motion adaptive line interpolating input fields of saidvideo signal.